Approximations of 3D generalized Voronoi diagrams
نویسندگان
چکیده
We introduce a new approach to approximate generalized 3D Voronoi diagrams for different site shapes (points, spheres, segments, lines, polyhedra, etc) and different distance functions (Euclidean metrics, convex distance functions, etc). The approach is based on an octree data structure denoted Voronoi-Octree (VO) that encodes the information required to generate a polyhedral approximation of the Voronoi diagram. Since the medial axis of a polyhedron is a subset of a generalized Voronoi diagram the VO can also be used to encode it. Using the information of the VO we generate and visualize a polyhedral approximation of a generalized Voronoi diagram, and we also solve proximity problems that do not require an explicit representation of the Voronoi diagram such as nearest neighbor queries.
منابع مشابه
Mobile Robot Online Motion Planning Using Generalized Voronoi Graphs
In this paper, a new online robot motion planner is developed for systematically exploring unknown environ¬ments by intelligent mobile robots in real-time applications. The algorithm takes advantage of sensory data to find an obstacle-free start-to-goal path. It does so by online calculation of the Generalized Voronoi Graph (GVG) of the free space, and utilizing a combination of depth-first an...
متن کاملInteractive Motion Planning Using Hardware-Accelerated Computation of Generalized Voronoi Diagrams
We present techniques for fast motion planning by using discrete approximations of generalized Voronoi diagrams, computed with graphics hardware. Approaches based on this diagram computation are applicable to both static and dynamic environments of fairly high complexity. We compute a discrete Voronoi diagram by rendering a three-dimensional distance mesh for each Voronoi site. The sites can be...
متن کاملInteractive Computation of Discrete Generalized Voronoi Diagrams using Range Culling
We present an algorithm for fast computation of discrete generalized Voronoi diagrams. Given a set of geometric primitives, and a distance metric, our algorithm efficiently computes the Voronoi diagram along a uniform grid by evaluating distance fields. We use a multipass approach and divide the computation into intervals along each dimension. We present an efficient culling algorithm to reduce...
متن کاملInteractive Motion Planning Using Hardware - AcceleratedComputation of Generalized Voronoi
We present techniques for fast motion planning by using discrete approximations of generalized Voronoi diagrams, computed with graphics hardware. Approaches based on this diagram computation are applicable to both static and dynamic environments of fairly high complexity. We compute a discrete Voronoi diagram by rendering a three-dimensional distance mesh for each Voronoi site. The sites can be...
متن کاملGeneralized Voronoi Diagrams on Polyhedral Terrains
We present an algorithm for computing exact shortest paths, and consequently distances, from a generalized source (point, segment, polygonal chain or polygonal region) on a polyhedral terrain in which polygonal chain or polygon obstacles are allowed. We also present algorithms for computing discrete Voronoi diagrams of a set of generalized sites (points, segments, polygonal chains or polygons) ...
متن کامل